Discovering Ranking Functions for Information Retrieval
نویسندگان
چکیده
The field of information retrieval deals with finding relevant documents from a large document collection or the World Wide Web in response to a user’s query seeking relevant information. Ranking functions play a very important role in the retrieval performance of such retrieval systems and search engines. A single ranking function does not perform well across different user queries, and document collections. Hence it is necessary to “discover” a ranking function for a particular context. Adaptive algorithms like genetic programming (GP) are well suited for such discovery.
منابع مشابه
Ranking Function Discovery by Genetic Programming for Robust Retrieval
Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on experience, observations and probabilistic theories. This paper tested a novel ranking function discovery technique proposed in [Fan 2003a, Fan2003b] – ARRANGER (Automatic geneRation of RANking functions by GEnetic pR...
متن کاملDiscovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the symbolic computation tools, DISCOVERER and QEPCAD, to some interesting examples. keywords: Program Verification, Loop Termination, Ranking Function, Polynomial Programs, Semi-Algebraic Systems, Computer Algebra, DISCOVERER, QEPCAD
متن کاملProgram Verification by Reduction to Semi-algebraic Systems Solving
The discovery of invariants and ranking functions plays a central role in program verification. In our previous work, we investigated invariant generation and non-linear ranking function discovering of polynomial programs by reduction to semi-algebraic systems solving. In this paper we will first summarize our results on the two topics and then show how to generalize the approach to discovering...
متن کاملA FLEXIBLE APPROACH FOR RANKING COMPLEX RELATIONSHIPS ON THE SEMANTIC WEB by
SEMANTIC WEB by CHRISTIAN HALASCHEK-WIENER (Under the Direction of I. Budak Arpinar and Amit P. Sheth) ABSTRACT The focus of contemporary Web information retrieval systems has been to provide efficient support for the querying and retrieval of relevant documents. More recently, information retrieval over semantic metadata extracted from the Web has received an increasing amount of interest in b...
متن کاملDiscovering and Ranking Semantic Associations over a Large RDF Metabase
Information retrieval over semantic metadata has recently received a great amount of interest in both industry and academia. In particular, discovering complex and meaningful relationships among this data is becoming an active research topic. Just as ranking of documents is a critical component of today’s search engines, the ranking of relationships will be essential in tomorrow’s semantic anal...
متن کامل